Towards Critical Pair Analysis for the Graph Programming Language GP 2
نویسندگان
چکیده
We present the foundations of critical pair analysis for the graph programming language GP 2. Our goal is to develop a static checker that can prove or refute confluence (functional behaviour) for a large class of graph programs. In this paper, we introduce symbolic critical pairs of GP 2 rule schemata, which are labelled with expressions, and establish the completeness and finiteness of the set of symbolic critical pairs over a finite set of rule schemata. We give a procedure for their construction.
منابع مشابه
Checking Graph Programs for Confluence
We present a method for statically verifying confluence (functional behaviour) of terminating sets of rules in the graph programming language GP 2, which is undecidable in general. In contrast to other work about attributed graph transformation, we do not impose syntactic restrictions on the rules except for left-linearity. Our checking method relies on constructing the symbolic critical pairs ...
متن کاملA Unification Algorithm for GP 2 (Long Version)
The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressions are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solutions represent different conflicts. We present a rule-based unification algorith...
متن کاملA Unification Algorithm for GP 2 (Long Version)
The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressions are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solutions represent different conflicts. We present a rule-based unification algorith...
متن کاملA Unification Algorithm for GP 2
The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressisons are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solutions represent different conflicts. We present a rule-based unification algorit...
متن کاملEvaluation and selection of sustainable suppliers in supply chain using new GP-DEA model with imprecise data
Nowadays, with respect to knowledge growth about enterprise sustainability, sustainable supplier selection is considered a vital factor in sustainable supply chain management. On the other hand, usually in real problems, the data are imprecise. One method that is helpful for the evaluation and selection of the sustainable supplier and has the ability to use a variety of data types is data envel...
متن کامل